- iterative smoothing
- итерационное сглаживание
English-Russian electronics dictionary .
iterative smoothing
Смотреть что такое "iterative smoothing" в других словарях:
Harris affine region detector — In the fields of computer vision and image analysis, the Harris affine region detector belongs to the category of feature detection. Feature detection is a preprocessing step of several algorithms that rely on identifying characteristic points or … Wikipedia
Deconvolution — In mathematics, deconvolution is an algorithm based process used to reverse the effects of convolution on recorded data.[1] The concept of deconvolution is widely used in the techniques of signal processing and image processing. Because these… … Wikipedia
List of numerical analysis topics — This is a list of numerical analysis topics, by Wikipedia page. Contents 1 General 2 Error 3 Elementary and special functions 4 Numerical linear algebra … Wikipedia
Local regression — LOESS, or locally weighted scatterplot smoothing, is one of many modern modeling methods that build on classical methods, such as linear and nonlinear least squares regression. Modern regression methods are designed to address situations in which … Wikipedia
Affine shape adaptation — is a methodology for iteratively adapting the shape of the smoothing kernels in an affine group of smoothing kernels to the local image structure in neighbourhood region of a specific image point. Equivalently, affine shape adaptation can be… … Wikipedia
Curve fitting — best fit redirects here. For placing ( fitting ) variable sized objects in storage, see fragmentation (computer). Curve fitting is the process of constructing a curve, or mathematical function, that has the best fit to a series of data points,… … Wikipedia
Least squares — The method of least squares is a standard approach to the approximate solution of overdetermined systems, i.e., sets of equations in which there are more equations than unknowns. Least squares means that the overall solution minimizes the sum of… … Wikipedia
Multigrid method — Multigrid (MG) methods in numerical analysis are a group of algorithms for solving differential equations using a hierarchy of discretizations. They are an example of a class of techniques called multiresolution methods, very useful in (but not… … Wikipedia
Cartographic generalization — Generalization has a long history in cartography as an art of creating maps for different scale and purpose. Cartographic generalization is the process of selecting and representing information of a map in a way that adapts to the scale of the… … Wikipedia
Cooperative optimization — is a global optimization method invented by chinese mathematician Xiao Fei Huang, that can solve real world NP hard optimization problems (up to millions of variables) with outstanding performances and unprecedented speeds. It knows whether a… … Wikipedia
Kalman filter — Roles of the variables in the Kalman filter. (Larger image here) In statistics, the Kalman filter is a mathematical method named after Rudolf E. Kálmán. Its purpose is to use measurements observed over time, containing noise (random variations)… … Wikipedia
